EFFICIENT DATA STRUCTURES AND PROTOCOLS WITH APPLICATIONS IN SPACE-TIME CONSTRAINED SYSTEMS By YAN QIAO A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY

of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy EFFICIENT DATA STRUCTURES AND PROTOCOLS WITH APPLICATIONS IN SPACE-TIME CONSTRAINED SYSTEMS By Yan Qiao May 2014 Chair: Shigang Chen Major: Computer Engineering Space-time efficient data structures can benefit many application systems. Space-efficiency describes a data structure that can fit compactly into the memory. The term time-efficiency implies that accessing/updating it requires short period of time. In this work, we cover space-time efficient data structures related to four abstract problems: set membership checking, multi-set membership checking, distributed set joining, and set size estimation. The goal is to improve the space-time efficiency of existing solutions. We first study an efficient set representation – the Bloom filter. Traditional Bloom filters offer excellent space efficiency, but each lookup requires multiple hash computations and multiple memory accesses. We propose a new family of space-time efficient Bloom filters that provide the same space efficiency, but requires much fewer memory accesses for each lookup. Due to wide applicability, any improvement to the performance of Bloom filters can potentially have a broad impact in many areas of research. Then we further propose a data structure for representing multi-sets, where a set ID is associated with each member element. Our proposed data structure can reduce the space and computational complexity, yet keep the error ratio in a pretty low level. Next, we design another Bloom filter variant called adaptive Bloom filter for efficient joining two distributed sets. When two nodes in distributed system exchange their